Appearance-Order-Based Schema Matching

Appearance-Order-Based Schema Matching

Schema matching is widely used in many applications, such as data integration, ontology merging, data warehouse and dataspaces. In this paper, we propose a novel matching technique that is based on the order of attributes appearing in the schema structure of query results. The appearance order embodies the extent of the importance of an attribute for the user examining the query results. The co...

Duplicate based schema matching

The integration of independently developed data sources poses many problems, which are the result of several types of heterogeneity. One of the most daunting challenges is schema matching, which is the semi-automatic process of detecting semantic relationships between attributes in heterogeneous schemata. Various solutions that exploit schema information or extract specific features from attrib...

Constraint - Based Schema Matching

Efficient Second-Order Predicate Schema Matching Algorithm

A schema is an abstracted or a generalized knowledge to help with solving problems. A second-order predicate schema matching is a problem of computing the matchers of a pair 〈P, p〉 such that P is a second-order predicate schema and p is a first order closed formula. The second-order matching is known as NP-complete,in general. We propose a new matching algorithm based on the pre-checking of the...

Instance-Based OWL Schema Matching

Schema matching is a fundamental issue in many database applications, such as query mediation and data warehousing. It becomes a challenge when different vocabularies are used to refer to the same real-world concepts. In this context, a convenient approach, sometimes called extensional, instancebased or semantic, is to detect how the same real world objects are represented in different database...